Classifying Categorical Data Based on Adoptive Hamming Distance

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classifying Categorical Data

Recent studies in classification have proposed ways of exploiting the association rule mining paradigm. These studies have performed extensive experiments to show their techniques to be both efficient and accurate. However, existing studies in this paradigm either do not provide any theoretical justification behind their approaches or assume independence between some parameters. In this thesis,...

متن کامل

Distance based Clustering for Categorical Data

Learning distances from categorical attributes is a very useful data mining task that allows to perform distance-based techniques, such as clustering and classification by similarity. In this article we propose a new context-based similarity measure that learns distances between the values of a categorical attribute (DILCA DIstance Learning of Categorical Attributes). We couple our similarity m...

متن کامل

On Computing the Hamming Distance

Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.

متن کامل

Context-Based Distance Learning for Categorical Data Clustering

Clustering data described by categorical attributes is a challenging task in data mining applications. Unlike numerical attributes, it is difficult to define a distance between pairs of values of the same categorical attribute, since they are not ordered. In this paper, we propose a method to learn a context-based distance for categorical attributes. The key intuition of this work is that the d...

متن کامل

Hamming Distance Based Compression Techniques with Security

The proposed algorithm suggests a lossless data compression with security. Input Bit stream is divided into a group of 8-bits each .Encoder deviate the available Randomly generated key according to input bit stream which results into encrypted data. Encrypted key of 64-bits is treated as unit of 4-bits each. Each 4-bits of Key will be at the Hamming distance is of Two from Deviated key. There w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2010

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.e93.d.189